Discovery of Application Workloads from Network File Traces.
An understanding of application I/O access patterns is useful in several situations. First, gaining insight into what applications are doing with their data at a semantic level helps in designing efficient storage systems. Second, it helps create benchmarks that mimic realistic application behavior closely. Third, it enables autonomic systems as the information obtained can be used to adapt the system in a closed loop. All these use cases require the ability to extract the application-level semantics of I/O operations. Methods such as modifying application code to associate I/O operations with semantic tags are intrusive. It is well known that network file system traces are an important source of information that can be obtained non-intrusively and analyzed
Robust Formulations for Handling Uncertainty in Kernel Matrices.
We study the problem of uncertainty in the entries of the Kernel matrix, arising in SVM formulation. Using Chance Constraint Programming and a novel large deviation inequality we derive a formulation which is robust to such noise. The resulting formulation applies when the noise is Gaussian, or has finite support. The formulation in general is non-convex, but in several cases of interest it reduces to a convex program. The problem of uncertainty in kernel matrix is motivated from the real world problem of classifying proteins when the structures are provided with some uncertainty. The formulation derived here naturally incorporates such uncertainty in a principled manner leading to significant improvements over the state of the art. 1.
Discovering Business Process Model from Unstructured Activity Logs.

Conditional Models for Non%2Dsmooth Ranking Loss Functions.
Learning to rank is an important area at the interface of machine learning, information retrieval and Web search. The central challenge in optimizing various measures of ranking loss is that the objectives tend to be non-convex and discontinuous. To make such functions amenable to gradient based optimization procedures one needs to design clever bounds. In recent years, boosting, neural networks, support vector machines, and many other techniques have been applied. However, there is little work on directly modeling a conditional probability Pr(y|xq) where y is a permutation of the documents to be ranked and xq represents their feature vectors with respect to a query q. A major reason is that the space of y is huge: n! if n documents must be ranked. We first propose an intuitive and appealing expected loss minimization objective, and give an efficient shortcut to evaluate it despite the huge space of ys. Unfortunately, the optimization is non-convex, so we propose a convex approximation. We give a new, efficient Monte Carlo sampling method to compute the objective and gradient of this approximation, which can then be used in a quasi-Newton optimizer like LBFGS. Extensive experiments with the widely-used LETOR dataset show large ranking accuracy improvements beyond recent and competitive algorithms. 1.
Discovering Rules from Disk Events for Predicting Hard Drive Failures.



A linear programming approach for estimating the structure of a sparse linear genetic network from transcript profiling data.

Randomized Algorithms for Large scale SVMs

Randomized Algorithms for Large scale SVMs

RAPID Resource of Asian Primary Immunodeficiency Diseases.

Structured learning for non%2Dsmooth ranking losses.
Learning to rank from relevance judgment is an active research area. Itemwise score regression, pairwise preference satisfaction, and listwise structured learning are the major techniques in use. Listwise structured learning has been applied recently to optimize important non-decomposable ranking criteria like AUC (area under ROC curve) and MAP (mean average precision). We propose new, almost-lineartime algorithms to optimize for two other criteria widely used to evaluate search systems: MRR (mean reciprocal rank) and NDCG (normalized discounted cumulative gain) in the max-margin structured learning framework. We also demonstrate that, for different ranking criteria, one may need to use different feature maps. Search applications should not be optimized in favor of a single criterion, because they need to cater to a variety of queries. E.g., MRR is best for navigational queries, while NDCG is best for informational queries. A key contribution of this paper is to fold multiple ranking loss functions into a multi-criteria max-margin optimization. The result is a single, robust ranking model that is close to the best accuracy of learners trained on individual criteria. In fact, experiments over the popular LETOR and TREC data sets show that, contrary to conventional wisdom, a test criterion is often not best served by training with the same individual criterion.
Clustering Based on Genetic Algorithms.

A large margin approach for writer independent online handwriting classification.

Fr%E9chet Distance Based Approach for Searching Online Handwritten Documents.

Focused crawling with scalable ordinal regression solvers.
In this paper we propose a novel, scalable, clustering based Ordinal Regression formulation, which is an instance of a Second Order Cone Program (SOCP) with one Second Order Cone (SOC) constraint. The main contribution of the paper is a fast algorithm, CB-OR, which solves the proposed formulation more efficiently than general purpose solvers. Another main contribution of the paper is to pose the problem of focused crawling as a large scale Ordinal Regression problem and solve using the proposed CB-OR. Focused crawling is an efficient mechanism for discovering resources of interest on the web. Posing the problem of focused crawling as an Ordinal Regression problem avoids the need for a negative class and topic hierarchy, which are the main drawbacks of the existing focused crawling methods. Experiments on large synthetic and benchmark datasets show the scalability of CB-OR. Experiments also show that the proposed focused crawler outperforms the state-of-the-art. 1.
Structural alignment based kernels for protein structure classification.
Structural alignments are the most widely used tools for comparing proteins with low sequence similarity. The main contribution of this paper is to derive various kernels on proteins from structural alignments, which do not use sequence information. Central to the kernels is a novel alignment algorithm which matches substructures of fixed size using spectral graph matching techniques. We derive positive semi-definite kernels which capture the notion of similarity between substructures. Using these as base more sophisticated kernels on protein structures are proposed. To empirically evaluate the kernels we used a 40 % sequence non-redundant structures from 15 different SCOP superfamilies. The kernels when used with SVMs show competitive performance with CE, a state of the art structure comparison program. 1.


A Randomized Algorithm for Large Scale Support Vector Learning.
We propose a randomized algorithm for large scale SVM learning which solves the problem by iterating over random subsets of the data. Crucial to the algorithm for scalability is the size of the subsets chosen. In the context of text classification we show that, by using ideas from random projections, a sample size of O(log n) can be used to obtain a solution which is close to the optimal with a high probability. Experiments done on synthetic and real life data sets demonstrate that the algorithm scales up SVM learners, without loss in accuracy. 1
Kernels on Attributed Pointsets with Applications.

Maximum Margin Classifiers with Specified False Positive and False Negative Error Rates.
This paper addresses the problem of maximum margin classification given the moments of class conditional densities and the false positive and false negative error rates. Using Chebyshev inequalities, the problem can be posed as a second order cone programming problem. The dual of the formulation leads to a geometric optimization problem, that of computing the distance between two ellipsoids, which is solved by an iterative algorithm. The formulation is extended to non-linear classifiers using kernel methods. The resultant classifiers are applied to the case of classification of unbalanced datasets with asymmetric costs for misclassification. Experimental results on benchmark datasets show the efficacy of the proposed method. 1
Comparison of protein structures by growing neighborhood alignments.

Clustering based large margin classification a scalable approach using SOCP formulation.
I would like to express sincere gratitude and thanks to my adviser, Dr. Chiranjib Bhat-tacharyya. With his interesting thoughts and ideas, inspiring ideals and friendly nature, he made sure I was filled with enthusiasm and interest to do research all through my PhD. He was always approachable and spent ample time with me and all my lab mem-bers for discussions, though he had a busy schedule. I also thank Prof. M. N. Murty, Dr. Samy Bengio (Google Labs, USA) and Prof. Aharon Ben-Tal (Technion, Israel) for their help and co-operation. I am greatly in debt to my parents, wife and other family members for supporting and encouraging me all through the PhD years. I thank all my lab members and friends, especially Karthik Raman, Sourangshu, Rashmin, Krishnan and Sivaramakrishnan, for their useful discussions and comments. I thank the Department of Science and Technology, India, for supporting me finan-cially during the PhD work. I would also like to take this opportunity to thank all the people who directly and indirectly helped in finishing my thesis. i Publications based on this Thesis
Projections for fast protein structure retrieval.

Second Order Cone Programming Approaches for Handling Missing and Uncertain Data.
We propose a novel second order cone programming formulation for designing robust classifiers which can handle uncertainty in observations. Similar formulations are also derived for designing regression functions which are robust to uncertainties in the regression setting. The proposed formulations are independent of the underlying distribution, requiring only the existence of second order moments. These formulations are then specialized to the case of missing values in observations for both classification and regression problems. Experiments show that the proposed formulations outperform imputation.
Second Order Cone Programming Approaches for Handling Missing and Uncertain Data.
We propose a novel second order cone programming formulation for designing robust classifiers which can handle uncertainty in observations. Similar formulations are also derived for designing regression functions which are robust to uncertainties in the regression setting. The proposed formulations are independent of the underlying distribution, requiring only the existence of second order moments. These formulations are then specialized to the case of missing values in observations for both classification and regression problems. Experiments show that the proposed formulations outperform imputation.
Ascent Phase Trajectory Optimization for a Hypersonic Vehicle Using Nonlinear Programming.

Efficient Algorithms for Intrusion Detection.
Abstract. Detecting user to root attacks is an important intrusion detection task. This paper uses a mix of spectrum kernels and probabilistic suffix trees, as a possible solution for detecting such intrusions efficiently. Experimental results on two real world datasets show that the proposed approach outperforms the state of the art Fisher Kernel based methods in terms of speed with no loss of accuracy. 1
Time Series Classification for Online Tamil Handwritten Character Recognition %2D A Kernel Based Approach.

A Second Order Cone programming Formulation for Classifying Missing Data.
We propose a convex optimization based strategy to deal with uncertainty in the observations of a classification problem. We assume that instead of a sample (xi, yi) a distribution over (xi, yi) is specified. In particular, we derive a robust formulation when the distribution is given by a normal distribution. It leads to Second Order Cone Programming formulation. Our method is applied to the problem of missing data, where it outperforms direct imputation. 1
Robust Sparse Hyperplane Classifiers Application to Uncertain Molecular Profiling Data.
Key words: robust sparse hyperplanes; second-order cone program; linear programming; breast cancer; molecular profiling; two-class high-dimensional data
Second Order Cone Programming Formulations for Feature Selection.
This paper addresses the issue of feature selection for linear classifiers given the moments of the class conditional densities. The problem is posed as finding a minimal set of features such that the resulting classifier has a low misclassification error. Using a bound on the misclassification error involving the mean and covariance of class conditional densities and minimizing an L1 norm as an approximate criterion for feature selection, a second order programming formulation is derived. To handle errors in estimation of mean and covariances, a tractable robust formulation is also discussed. In a slightly different setting the Fisher discriminant is derived. Feature selection for Fisher discriminant is also discussed. Experimental results on synthetic data sets and on real life microarray data show that the proposed formulations are competitive with the state of the art linear programming formulation. 1.
Simultaneous classification and relevant feature identification in high%2Ddimensional spaces application to molecular profiling data.

Simultaneous Relevant Feature Identification and Classification in High%2DDimensional Spaces.
Molecular profiling technologies monitor thousands of transcripts, proteins, metabolites or other species concurrently in biological samples of interest. Given two-class, high-dimensional profiling data, nominal Liknon [4] is a specific implementation of a methodology for performing simultaneous relevant feature identification and classification. It exploits the well-known property that minimising an l_1 norm (via linear programming) yields a sparse hyperplane [15, 26, 2, 8, 17]. This work (i) examines computational, software and practical issues required to realise nominal Liknon, (ii) summarises results from its application to five real world data sets, (iii) outlines heuristic solutions to problems posed by domain experts when interpreting the results and (iv) defines some future directions of the research.


Minimax Probability Machine.
When constructing a classi  er, the probability of correct classi  -  cation of future data points should be maximized. In the current  paper this desideratum is translated in a very direct way into an  optimization problem, which is solved using methods from convex  optimization. We also show how to exploit Mercer kernels in  this setting to obtain nonlinear decision boundaries. A worst-case  bound on the probability of misclassi  cation of future data is obtained  explicitly.
Mean Field Methods for a Special Class of Belief Networks.
The chief aim of this paper is to propose mean-field approximations for a broad class of Belief networks, of which sigmoid and noisy-or networks can be seen as special cases. The approximations are based on a powerful mean-field theory suggested by Plefka. We show that Saul, Jaakkola, and Jordan&#039;s approach is the first order approximation in Plefka &#039;s approach, via a variational derivation. The application of Plefka&#039;s theory to belief networks is not computationally tractable. To tackle this problem we propose new approximations based on Taylor series. Small scale experiments show that the proposed schemes are attractive. 1. 
Improvements to Platt%27s SMO Algorithm for SVM Classifier Design.
This paper points out an important source of confusion and ineciency in Platt&#039;s Sequential  Minimal Optimization (SMO) algorithm that is caused by the use of a single threshold value.  Using clues from the KKT conditions for the dual problem, two threshold parameters are employed  to derive modications of SMO. These modied algorithms perform signicantly faster  than the original SMO on all benchmark datasets tried.  1 Introduction  In the past few years, there has been a lot of excitement and interest in Support Vector Machines[16, 2] because they have yielded excellent generalization performance on a wide range of problems. Recently, fast iterative algorithms that are also easy to implement have been suggested[9,4,7,3,6]. Platt&#039;s Sequential Minimization Algorithm (SMO)[9,11] is an important example. A remarkable feature of SMO is that it is also extremely easy to implement. Comparative testing against other algorithms, done by Platt, have shown that SMO is often much faster and has...
A Variational Mean%2DField Theory for Sigmoidal Belief Networks.

